Fault-Tolerant Distributed Theorem Proving
نویسنده
چکیده
Higher order logics are expressive tools for tasks ranging from formalizing the foundations of mathematics to large scale soft ware veri cation and synthesis Because of their complexity proofs in higher order logics often use a combination of interactive proving to gether with computationally intensive tactic applications that perform proof automation As problems and proof automation become more so phisticated these proofs represent substantial investments each inter active step may represent several hours of design time We present an implementation of a distributed proving architecture to address the problems of speed availability and reliability in tactic provers This architecture is implemented as a module in the MetaPRL logical framework The implementation supports arbitrary process joins and all but one process failures at any time during a proof Proof distribution is completely transparent the existing tactic base is unmodi ed
منابع مشابه
A Test Generation Framework for Distributed Fault-Tolerant Algorithms
Heavyweight formal methods such as theorem proving have been successfully applied to the analysis of safety critical fault-tolerant systems. Typically, the models and proofs performed during such analysis do not inform the testing process of actual implementations. We propose a framework for generating test vectors from specifications written in the Prototype Verification System (PVS). The meth...
متن کاملFormal Verification of Distributed Algorithms - From Pseudo Code to Checked Proofs
We exhibit a methodology to develop mechanically-checkable parameterized proofs of the correctness of fault-tolerant round-based distributed algorithms in an asynchronous message-passing setting. Motivated by a number of case studies, we sketch how to replace often-used informal and incomplete pseudo code by mostly syntax-free formal and complete definitions of a global-state transition system....
متن کاملVerification of Distributed Erlang Programs using Testing, Model Checking and Theorem Proving
Software infiltrates every aspect of modern society. Production, transportation, entertainment, and almost every other sphere that influences modern living are either directly or indirectly dependent on software systems. Software systems provide such a degree of flexibility that their role as a driving force for new and better products is indisputable. The downside is that software systems are ...
متن کاملFormal Specification and Verification of the Intrusion-Tolerant Enclaves Protocol
We demonstrate the application of formal methods to the verification of intrusion-tolerant agreement protocols that have a distributed leadership and can tolerate Byzantine faults. As an interesting case study, the Enclaves groupmembership protocol has been verified using two techniques: model checking and theorem proving. We use the model checker Murphi to prove the correctness of authenticati...
متن کاملA case-study in component-based mechanical verification of fault-tolerant programs
In this paper, we present a case study to demonstrate that the decomposition of a fault-tolerant program into its components is useful in its mechanical verification. More specifically, we discuss our experience in using the theorem prover PVS to verify Dijkstra’s token ring program in a component-based manner. We also demonstrate the advantages of component based mechanical verification.
متن کاملA Case-Study in Component-Based Mechanical Verification of Fault-Tolerant Programs1 To appear in Fourth Workshop on Self-Stabilization (WSS’99) Austin, Texas, USA
In this paper, we present a case study to demonstrate that the decomposition of a fault-tolerant program into its components is useful in its mechanical verification. More specifically, we discuss our experience in using the theorem prover PVS to verify Dijkstra’s token ring program in a component-based manner. We also demonstrate the advantages of component based mechanical verification.
متن کامل